A FAMILY OF CODES COMMUTATIVELY EQUIVALENT TO PREFIX CODESMAUCERI S; RESTIVO A.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 1; PP. 1-4; BIBL. 5 REF.Article

LE DEGRE MINIMAL DU GROUPE D'UN CODE BIPREFIXE FINIPERRIN D.1978; J. COMBINATOR. THEORY, A; USA; DA. 1978; VOL. 25; NO 2; PP. 163-173; ABS. ENG; BIBL. 11 REF.Article

CONJECTURES ON UNIQUELY DECIPHERABLE CODES.CARTER L; GILL J.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 3; PP. 394-396; BIBL. 8 REF.Article

SUR UN ALGORITHME DONNANT LES CODES BIPREFIXES FINISCESARI Y.1972; MATH. SYST. THEORY; U.S.A.; DA. 1972; VOL. 6; NO 3; PP. 221-225; BIBL. 3 REF.Serial Issue

CODES: UNEQUAL PROBABILITIES, UNEQUAL LETTER COSTS.ALTENKAMP D; MEHLHORN K.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 15-25; BIBL. 12 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

AN EFFICIENT ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL PREFIX CODESMEHLHORN K.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 5; PP. 513-517; BIBL. 8 REF.Article

SUR LES CODES D'INCLUSIONBOE JM.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 21; NO 3; PP. 291-300; ABS. ANGL.; BIBL. 7 REF.Serial Issue

CODES: UNEQUAL PROBABILITIES, UNEQUAL LETTER COSTSALTENKAMP D; MEHLHORN K.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 3; PP. 412-427; BIBL. 19 REF.Article

MAXIMAL PREFIX-SYNCHRONIZED CODESGUIBAS LJ; ODLYZKO AM.1978; S.I.A.M. J. APPL. MATH.; USA; DA. 1978; VOL. 35; NO 2; PP. 401-418; BIBL. 12 REF.Article

A UNIMODALITY PROPERTY OF OPTIMAL EXHAUSTIVE PREFIX CODES AND RETRIEVAL TREES OVER ALPHABETS OF VARYING SIZE.STANFEL LE.1977; INFORM. SYST.; G.B.; DA. 1977; VOL. 2; NO 4; PP. 199-205; BIBL. 6 REF.Article

CODES DE COMPRESSION A PREFIXE.MARGUINAUD A.1974; REV. CETHEDEC; FR.; DA. 1974; VOL. 11; NO 41; PP. 61-71; ABS. ANGL.; BIBL. 3 REF.Article

TEAM TOURNAMENTS AND FINITE ELEMENTARY CODESLALLEMENT G; REIS C.1981; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1981; VOL. 48; NO 1; PP. 11-29; BIBL. 9 REF.Article

EFFICIENT GENERATION OF OPTIMAL PREFIX CODE: EQUIPROBABLE WORDS USING UNEQUAL COST LETTERS.PERL Y; GAREY MR; EVEN S et al.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 2; PP. 202-214; BIBL. 6 REF.Article

CODES BIPREFIXES ET GROUPES DE PERMUTATIONS.PERRIN D.1975; AO-CNRS-13414; FR.; DA. 1975; PP. 1-111; BIBL. 3 P. 1/2; (THESE DOCT. SPEC. MATH.; PARIS VII)Thesis

A CORRESPONDENCE ON STRONGLY PREFIX CODES.LASSEZ JL.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 3; PP. 344-345; BIBL. 5 REF.Article

REGULAR SEMIGROUPS WITH = AS SYNTHACTIC MONOIDS OF PREFIX CODES.LALLEMENT G.1976; THEOR. COMPUTER SCI.; NETHL.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 35-49; BIBL. 9 REF.Article

CODAGE DES FONCTIONS DISCRETES AVEC UNE SOMME DE VALEURS DONNEEBABKIN VF; KRYUKOV AB.1975; IN: KODIROVANIE SLOZHNYKH SIST.; MOSKVA; NAUKA; DA. 1975; PP. 184-188; BIBL. 4 REF.Book Chapter

CHARACTERIZATIONS FOR THE REGULAR PREFIX CODES AND RELATED FAMILIESVELOSO PAS.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 5; PP. 371-382; BIBL. 9 REF.Article

Bi-catenation and shuffle product of languagesSHYR, H. J; YU, S. S.Acta informatica. 1998, Vol 35, Num 8, pp 689-707, issn 0001-5903Article

On the mean number of stuffing bits in a prefix-synchronized codePAPASTAVRIDIS, S.IEEE transactions on communications. 1987, Vol 35, Num 4, pp 453-455, issn 0090-6778Article

Code properties and homomorphisms of DOL systemsHEAD, T; WILKINSON, J.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 295-312, issn 0304-3975Article

Top-bottom routing around a rectangle is as easy as computing prefix minimaBERKMAN, O; JAJA, J; KRISHNAMURTHY, S et al.SIAM journal on computing (Print). 1994, Vol 23, Num 3, pp 449-465, issn 0097-5397Article

BLOCK CODING OF GRAPHICS: A TUTORIAL REVIEWKUNT M; JOHNSEN O.1980; PROC. I.E.E.E.; USA; DA. 1980; VOL. 68; NO 7; PP. 770-786; BIBL. 27 REF.Article

CHARACTERIZING THE REGULAR PREFIX CODES AND RIGHT POWER-BOUNDED LANGUAGESVELOSO PAS.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 5-7; BIBL. 8 REF.Article

VARIATIONS ON A THEME BY HUFFMANGALLAGER RG.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 6; PP. 668-674; BIBL. 2 REF.Article